Radial View of Continuous Cellular Automata

نویسندگان

  • Paola Flocchini
  • Vladimir Cezar
چکیده

Continuous cellular automata (or coupled map lattices) are cellular automata where the state of the cells are real values in [0, 1] and the local transition rule is a real function. The classical observation medium for cellular automata, whether Boolean or continuous, is the space-time diagram, where successive rows correspond to successive configurations in time. In this paper we introduce a different way to visualize the evolution of continuous cellular automata called Radial Representation and we employ it to observe a particular class of continuous cellular automata called fuzzy cellular automata (FCA), where the local rule is the “fuzzification” of the disjunctive normal form that describes the local rule of the corresponding Boolean cellular automata. Our new visualization method reveals interesting dynamics that are not easily observable with the space-time diagram. In particular, it allows us to detect the quick emergence of spatial correlations among cells and to observe that all circular FCA from random initial configurations appear to converge towards an asymptotic periodic behavior. We propose an empirical classification of FCA based on the length of the observed periodic behavior: interestingly, all the minimum periods that we observe are of lengths one, two, four, or n (where n is the size of a configuration).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Frog Leaping Algorithm Using Cellular Learning Automata

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

Radial View: Observing Fuzzy Cellular Automata with a New Visualization Method

Fuzzy Cellular Automata (FCA) are special couple map lattices that generalize Boolean cellular automata by allowing continuous values for the cell states. The local transition rule of a FCA is the “fuzzification" of the disjunctive normal form that describes the local function of the corresponding Boolean cellular automata. Recently there has been some interest in elementary Fuzzy cellular auto...

متن کامل

The signal point of view: from cellular automata to signal machines

After emphasizing on the use of discrete signals in the literature on cellular automata, we show how these signals have been considered on their own. We then present their continuous counterpart: abstract geometrical computation and signal machines. Finally we relate them to other models of computation, classical and analog. Key-words. abstract geometrical computation, analog/continuous computa...

متن کامل

A multi-lane traffic simulation model via continuous cellular automata

Traffic models based on cellular automata have high computational efficiency because of their simplicity in describing unrealistic vehicular behavior and the versatility of cellular automata to be implemented on parallel processing. On the other hand, the other microscopic traffic models such as car-following models are computationally more expensive, but they have more realistic driver behavio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fundam. Inform.

دوره 87  شماره 

صفحات  -

تاریخ انتشار 2008